Preserving Sparity for General Solution of Linear Diophantine Systems
نویسنده
چکیده
Here, we present an efficient algorithm for preserveving sparsity in computing the general solution of linear Diophantin systems. In the kth iteration of the algorithm, the general solution k − 1 equations of the systems is at hand. Then, we present numerical results to justify the efficiency of the resulting algorithm. Mathematics Subject Classification: 11D04, 65Y04
منابع مشابه
The embedding method to obtain the solution of fuzzy linear systems
In this paper, we investigate the general fuzzy linear system of equations. The main aim of this paper is based on the embedding approach. We find the necessary and sufficient conditions for the existence of fuzzy solution of the mentioned systems. Finally, Numerical examples are presented to more illustration of the proposed model.
متن کاملPositive solution of non-square fully Fuzzy linear system of equation in general form using least square method
In this paper, we propose the least-squares method for computing the positive solution of a $mtimes n$ fully fuzzy linear system (FFLS) of equations, where $m > n$, based on Kaffman's arithmetic operations on fuzzy numbers that introduced in [18]. First, we consider all elements of coefficient matrix are non-negative or non-positive. Also, we obtain 1-cut of the fuzzy number vector solution of ...
متن کاملPell ’ s Equation
An arbitrary quadratic diophantine equation with two unknowns can be reduced to a Pell-type equation. How can such equations be solved? Recall that the general solution of a linear diophantine equation is a linear function of some parameters. This does not happen with general quadratic diophantine equations. However, as we will see later, in the case of such equations with two unknowns there st...
متن کاملSolving equations in free nilpotent groups
In this paper we show that any system of equations over a free nilpotent group of class c is either unitary or nullary. In fact, such a system either has a most general solution (akin to the most general solution of a system of linear diophantine equations), or every solution has a proper generalization. In principle we provide an algorithm for determining whether or not a most general solution...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013